Quantum adiabatic optimization and combinatorial landscapes
نویسندگان
چکیده
منابع مشابه
Quantum adiabatic optimization and combinatorial landscapes.
In this paper we analyze the performance of the Quantum Adiabatic Evolution algorithm on a variant of the satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma=M/N . We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the small...
متن کاملNon-hermitian Adiabatic Quantum Optimization
Many physical and combinatorial problems associated with complex networks of interacting degrees of freedom can be mapped to equivalent problems of finding the ground (or minimum cost) state of a corresponding quantum Hamiltonian H0 1,2,3,4,5,6,7,8,9. One of the approaches to finding the ground state of H0 is adiabatic quantum computation which can be formulated as follows. Consider the time de...
متن کاملDecomposition and gluing for adiabatic quantum optimization
Farhi and others [8] have introduced the notion of solving NP problems using adiabatic quantum computers. We discuss an application of this idea to the problem of integer factorization, together with a technique we call gluing which can be used to build adiabatic models of interesting problems. Although adiabatic quantum computers already exist, they are likely to be too small to directly tackl...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملAdiabatic quantum optimization for associative memory recall
2 Hopfield networks are a variant of associative memory that recall patterns stored in the 3 couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the 4 network dynamics that correspond to energetic minima of the spin state. We show that memories 5 stored in a Hopfield network may also be recalled by energy minimization using adiabatic 6 quantum optimizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2004
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.70.036702